The Randomized Integer Convex Hull

نویسندگان

  • Imre Bárány
  • Jirí Matousek
چکیده

Let K ⊂ R d be a sufficiently round convex body (the ratio of the circumscribed ball to the inscribed ball is bounded by a constant) of a sufficiently large volume. We investigate the randomized integer convex hull I L (K) = conv(K ∩L), where L is a randomly translated and rotated copy of the integer lattice Z d. We estimate the expected number of vertices of I L (K), whose behaviour is similar to the expected number of vertices of the convex hull of VolK random points in K. In the planar case we also describe the expectation of the missed area Vol(K \I L (K)). Surprisingly, for K a polygon, the behaviour in this case is different from the convex hull of random points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some properties of convex hulls of integer points contained in general convex sets

In this paper, we study properties of general closed convex sets that determine the closed-ness and polyhedrality of the convex hull of integer points contained in it. We first present necessary and sufficient conditions for the convex hull of integer points contained in a general convex set to be closed. This leads to useful results for special class of convex sets such as pointed cones, stric...

متن کامل

Computing Two-Dimensional Integer Hulls

An optimal algorithm is presented for computing the smallest set of linear inequalities that define the integer hull of a possibly unbounded two-dimensional convex polygon R. Input to the algorithm is a set of linear inequalities defining R, and the integer hull computed is the convex hull of the integer points of R. It is proven that the integer hull has at most O(n logAmax) inequalities, wher...

متن کامل

Sum of Sets of Integer Points of Common-Normal Faces of Integer Polyhedra

We consider the Minkowski sum of subsets of integer lattice, each of which is a set of integer points of a face of an extended submodular [Kashiwabara–Takabatake, Discrete Appl. Math. 131 (2003) 433] integer polyhedron supported by a common positive vector. We show a sufficient condition for the sum to contain all the integer points of its convex hull and a sufficient condition for the sum to i...

متن کامل

The convex hull of a regular set of integer vec - tors is polyhedral and effectively computable Alain Finkel

Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors represented by a NDD is proved to be an effectively computable convex polyhedron.

متن کامل

Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets

This paper focuses on the outer description of the convex hull of all integer solutions to a given system of linear inequalities. It is shown that if the given system contains lower and upper bounds for the variables , then the convex hull can be produced by iteratively generating so-called mod-2 cuts only. This fact is surprising and might even be counterintuitive, since many integer rounding ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2005